A Subsequence Principle Characterizing

نویسنده

  • HASKELL ROSENTHAL
چکیده

The notion of a strongly summing sequence is introduced. Such a sequence is weak-Cauchy, a basis for its closed linear span, and has the crucial property that the dual of this span is not weakly sequentially complete. The main result is: Theorem. Every non-trivial weak-Cauchy sequence in a (real or complex) Banach space has either a strongly summing sequence or a convex block basis equivalent to the summing basis. (A weak-Cauchy sequence is called non-trivial if it is non-weakly convergent .) The following characterization of spaces containing c0 is thus obtained, in the spirit of the author’s 1974 subsequence principle characterizing Banach spaces containing l 1. Corollary 1. A Banach space B contains no isomorph of c0 if and only if every non-trivial weak-Cauchy sequence in B has a strongly summing subsequence. Combining the c0-and l1-theorems, one obtains Corollary 2. If B is a non-reflexive Banach space such that X∗ is weakly sequentially complete for all linear subspaces X of B, then c0 embeds in B.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A SUBSEQUENCE PRINCIPLE CHARACTERIZING BANACH SPACES CONTAINING c0

The notion of a strongly summing sequence is introduced. Such a sequence is weak-Cauchy, a basis for its closed linear span, and has the crucial property that the dual of this span is not weakly sequentially complete. The main result is: Theorem. Every non-trivial weak-Cauchy sequence in a (real or complex) Banach space has either a strongly summing sequence or a convex block basis equivalent t...

متن کامل

On the Sequencing of Tree Structures for XML Indexing

Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. In this paper, we address the problem of query equivalence with respect to this transformation, and we introduce a performance-oriented principle for sequencing tree stru...

متن کامل

Exploring the Computational Content of the Infinite Pigeonhole Principle

The use of classical logic for some combinatorial proofs, as it is the case with Ramsey’s theorem, can be localized in the Infinite Pigeonhole (IPH) principle, stating that any infinite sequence which is finitely colored has an infinite monochromatic subsequence. Since in general there is no computable functional producing such an infinite subsequence, we consider a Π2-corollary, proving the cl...

متن کامل

On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet

In this paper we investigate the complexity of finding various kinds of common superand subsequences with respect to one or two given sets of strings. We show that Longest Minimal Common Supersequence, Shortest Maximal Common Subsequence, and Shortest Maximal Common Non-Supersequence are MAX SNP-hard over a binary alphabet. Moreover, we show that Shortest Common Supersequence, Longest Common Su...

متن کامل

On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences

In this paper we investigate the complexity of nding various kinds of common super-and subsequences with respect to one or two given sets of strings. We show how these problems can be related to nding sequences having a xed character composition. This leads to a uniied approach for characterizing the complexity of such problems. Moreover , we derive interesting results on the approximability of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994